Quantum algorithms (CO 781, WinterProf. Andrew Childs, University of Waterloo LECTURE 16: Quantum walk algorithm for element distinctness In this lecture we will discuss the algorithm that cemented the importance

Source URL: www.math.uwaterloo.ca

Quantum algorithms (CO 781, WinterProf. Andrew Childs, University of Waterloo LECTURE 7: Fourier analysis in nonabelian groups We have seen that hidden subgroup states contain sufficient information to determine t

Source URL: www.math.uwaterloo.ca

Game Theory in Formal Verification Scribe notes for Lecture 6 Algorithms for Parity Games Arjun Radhakrishna April 28, 2010

Source URL: pub.ist.ac.at

• Rho
• Physics
• Parity
• Quantum field theory

Quantum Computing and Cryptography Spring Semester 2011 Steve Vickers The University of Birmingham School of Computer Science

Source URL: www.cs.bham.ac.uk

• Electronic commerce
• Integer factorization algorithms
• RSA
• Prime number
• Modular arithmetic
• Coprime
• Euclidean algorithm
• Greatest common divisor
• Cryptography
• Mathematics
• Public-key cryptography

Seminar on Sublinear Time Algorithms Lecture 5 April 21, 2010 Lecturer: Robert Krauthgamer

Source URL: www.wisdom.weizmann.ac.il

• Quantum complexity theory
• Probabilistic complexity theory
• Models of computation
• Analysis of algorithms
• Randomized algorithm
• PP
• Decision tree model
• IP
• MAX-3SAT
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

Comparing algorithms for diffeomorphic registration: Stationary LDDMM and Diffeomorphic Demons Monica Hernandez1 , Salvador Olmos1 , and Xavier Pennec2 1

Source URL: www-sop.inria.fr

• Mathematical physics
• Lie groups
• Quantum field theory
• Diffeomorphism
• Regularization
• Handle decomposition
• Topology
• Physics
• Theoretical physics

Tight Bounds for Asynchronous Renaming1 DAN ALISTARH, Microsoft Research Cambridge JAMES ASPNES2 , Yale KEREN CENSOR-HILLEL3 , Technion SETH GILBERT4 , National University of Singapore RACHID GUERRAOUI, EPFL

Source URL: cs-www.cs.yale.edu

• Analysis of algorithms
• Algorithm
• Time complexity
• Randomized algorithm
• Adversary model
• Consensus
• Distributed computing
• Complexity
• Quantum algorithm
• Theoretical computer science
• Applied mathematics
• Computational complexity theory

The Complexity of Renaming Dan Alistarh EPFL James Aspnes Yale

Source URL: cs-www.cs.yale.edu

• Computer science
• Algorithm
• Randomized algorithm
• Time complexity
• Adversary model
• Asymptotically optimal algorithm
• Quantum algorithm
• Computational complexity theory
• Theoretical computer science
• Applied mathematics
• Analysis of algorithms

Tight Bounds for Lp Samplers, Finding Duplicates in Streams, and Related Problems arXiv:1012.4889v1 [cs.DS] 22 DecHossein Jowhari1 , Mert Sa˘glam1 , and G´abor Tardos1,2

Source URL: arxiv.org

• Analysis of algorithms
• Probabilistic complexity theory
• Quantum complexity theory
• Randomized algorithm
• Chernoff bound
• PP
• Big O notation
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

MIT-CTP #3309 Exponential algorithmic speedup by quantum walk Andrew M. Childs,1, ∗ Richard Cleve,2, † Enrico Deotto,1 , ‡ Edward Farhi,1, § Sam Gutmann,3, ¶ and Daniel A. Spielman4, ∗∗

Source URL: arxiv.org

• Quantum algorithms
• Quantum information science
• Quantum computer
• Quantum walk
• SL
• Quantum Fourier transform
• Neighbourhood
• Continuous-time quantum walk
• Line graph
• Graph theory
• Theoretical computer science
• Mathematics